Vertical Ray Shooting and Computing Depth Orders for Fat Objects
نویسندگان
چکیده
منابع مشابه
Vertical ray shooting and computing depth orders of fat objects
We present new results for three problems dealing with a set P of n convex constantcomplexity fat polyhedra in 3-space. (i) We describe a data structure for vertical ray shooting in P that has O(log n) query time and uses O(n log n) storage. (ii) We give an algorithm to compute in O(n log n) time a depth order on P if it exists. (iii) We give an algorithm to verify in O(n log n) time whether a ...
متن کامل3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain eecient and rather simple solutions to several problems including (i) vertical ray shooting | preprocess a set K of n non-intersecting convex simply-shaped at objects in 3-space, whose xy-projections are fat, for eecient vertical ray shooting queries, (ii) point enclosure | preproc...
متن کاملRay-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R. These include Tukey depth [15], Oja depth [12], Simplicial depth [10] and several others. Recently Fox et al. [7] have defined the Ray-Shooting depth of a point set, and given a topological proof for the existence of points with high Ray-Shooting depth...
متن کاملComputing Depth Orders and Related Problems
Let K be a set of n non-intersecting objects in 3-space. A depth order of K, if exists, is a linear order < of the objects in K such that if K; L 2 K and K lies vertically below L then K < L. We present a new technique for computing depth orders, and apply it to several special classes of objects. Our results include: (i) If K is a set of n triangles whose xy-projections are alìfat', then a dep...
متن کاملRay Shooting Amidst Fat Convex Polyhedra in 3-Space
We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R. The data structure uses O(n) storage and preprocessing time, and queries can be answered in O(log n) time. A trade-off between storage and query time is also possible: for any m with n < m < n, we can construct a structure that uses O(m) storage and preprocessing time such that quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060672261